Nearly time optimal stabilizing patchy feedbacks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly Time Optimal Stabilizing Patchy Feedbacks

We consider the time optimal stabilization problem for a nonlinear control system ẋ = f(x, u). Let τ(y) be the minimum time needed to steer the system from the state y ∈ R to the origin, and call A(T ) the set of initial states that can be steered to the origin in time τ(y) ≤ T . Given any ε > 0, in this paper we construct a patchy feedback u = U(x) such that every solution of ẋ = f(x, U(x)), x...

متن کامل

Nearly Optimal Patchy Feedbacks

The paper is concerned with a general optimization problem for a nonlinear control system, in the presence of a running cost and a terminal cost, with free terminal time. We prove the existence of a patchy feedback whose trajectories are all nearly optimal solutions, with pre-assigned accuracy.

متن کامل

Nearly Optimal Patchy Feedbacks for Minimization Problems with Free Terminal Time

The paper is concerned with a general optimization problem for a nonlinear control system, in the presence of a running cost and a terminal cost, with free terminal time. We prove the existence of a patchy feedback whose trajectories are all nearly optimal solutions, with pre-assigned accuracy. 1 Introduction Consider a general optimization problem min T,u(·) {

متن کامل

Patchy Feedbacks for Stabilization and Optimal Control: General Theory and Robustness Properties

This paper provides a survey of the theory of patchy feedbacks, and its applications to asymptotic stabilization and optimal control. It also contains two new results, showing the robustness of sub-optimal patchy feedbacks both in the case of (internal and external) deterministic disturbances, and of random perturbations modelled by stochastic Brownian motion.

متن کامل

Maximizing Social Influence in Nearly Optimal Time

Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network diffusion. Runtime is a primary consider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire

سال: 2007

ISSN: 0294-1449

DOI: 10.1016/j.anihpc.2006.03.010